Solving school bus routing problems through integer programming

Solving school bus routing problems through integer programming

A new approach for solving neutrosophic integer programming problems

Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...

Conflict graphs in solving integer programming problems

We report on the use of con ict graphs in solving integer programs A con ict graph represents logical relations between binary variables We develop algorithms and data structures that allow the e ective and e cient construction management and use of dynamically changing con ict graphs Our computational experiments show that the techniques presented work very well

Solving Rummikub Problems by Integer Linear Programming

The Rummikub problem of finding the maximal number or value of the tiles that can be placed from your rack onto the table is very difficult, since the number of possible combinations are enormous. We show that this problem can be modeled as an integer linear programming problem. In this way solutions can be found in 1 s. We extend the model such that unnecessary changes of the existing sets on ...

Progress in solving large scale multi-depot multi-vehicle-type bus scheduling problems with integer programming

This paper discusses solution methods of multi-depot, multi-vehicle-type bus scheduling problems (MDVSP), involving multiple depots for vehicles and different vehicle types for timetabled trips. All models are from real-life applications. Key elements of the application are a mixed-integer model based on time-space-based networks for MDVSP modeling and a customized version of the mathematical o...